- Title
- On inclusive and non-inclusive vertex irregular d-distance vertex labeling
- Creator
- Bong, N. H.; Lin, Y.; Slamin
- Relation
- Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 113, p. 233-247
- Publisher
- Charles Babbage Research Centre
- Resource Type
- journal article
- Date
- 2020
- Description
- In this paper, we generalise the notion of distance irregular labeling introduced by Slamin to vertex irregular d-distance vertex labeling, for any distance d up to the diameter. We also define the inclusive vertex irregular d-distance vertex labeling. We give the lower bound of the inclusive vertex irregular 1-distance vertex labeling for general graphs and a better lower bound on caterpillars. The inclusive labelings for paths P.,n = 0 mod 3, stars S, double stars S(m,n), cycles C., and wheels Wn are provided. From the inclusive vertex irregular 1-distance vertex labeling on cycles, we derive the vertex irregular 1-distance vertex labeling on prisms.
- Subject
- distance-irregular labeling; vertex irregular d-distance vertex labeling; inclusive vertex irregular d-distance vertex labeling; graphs
- Identifier
- http://hdl.handle.net/1959.13/1484588
- Identifier
- uon:51379
- Identifier
- ISSN:0835-3026
- Language
- eng
- Reviewed
- Hits: 953
- Visitors: 941
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|